Belief rule-based classification system: Extension of FRBCS in belief functions framework
نویسندگان
چکیده
منابع مشابه
Belief rule-based classification system: Extension of FRBCS in belief functions framework
Among the computational intelligence techniques employed to solve classification problems, the fuzzy rule-based classification system (FRBCS) is a popular tool capable of building a linguistic model interpretable to users. However, it may face lack of accuracy in some complex applications, by the fact that the inflexibility of the concept of the linguistic variable imposes hard restrictions on ...
متن کاملConstructing Rule-Based Models Using the Belief Functions Framework
We study a new approach to regression analysis. We propose a new rule-based regression model using the theoretical framework of belief functions. For this purpose we use the recently proposed Evidential c-means (ECM) to derive rule-based models solely from data. ECM allocates, for each object, a mass of belief to any subsets of possible clusters, which allows to gain a deeper insight on the dat...
متن کاملClassification Trees Based on Belief Functions
Decision trees classifiers are popular classification methods. In this paper, we extend to multi-class problems a decision tree method based on belief functions previously described for 2-class problems only. We propose two ways to achieve this extension: combining multiple 2-class trees together and directly extending the estimation of belief functions within the tree to the multi-class settin...
متن کاملStructures of rule - based belief functions by William
Shafer’s theory of evidential reasoning has recently received much attention as a possible model for probabilistic reasoning in expert system applications. This paper discusses the particular difficulties of implementing Shafer’s belief functions in the context of the most common form of expert system, rule-based systems. The two most important problems are: the representation of the expert’s s...
متن کاملMerging rule-based belief databases
The problem of revising a belief database is treated in many classical works. We will consider here the problem of merging two belief databases (BDBs for short) Ψ1 and Ψ2, operation that will be denoted byΨ1 Ψ2, and whose result will be a new BDB. Since belief not necessarily reflects the actual state of the world (as opposed to knowledge), both BDBs could be incompatible. The goal is to constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2015
ISSN: 0020-0255
DOI: 10.1016/j.ins.2015.03.005